Chart Parsing Lambek Grammars: Modal Extensions And Incrementality
نویسنده
چکیده
This paper I describes a method for chart parsing Lambek g rammars . The method is of part icular interest in two regards. Firstly, it allows efficient processing of g rammars which use necessity operators, mr extension proposed for handling locality phenomena. Secondly, the method is easily adapted to allow incremental proceasing of Lambek grammars , a possibility tha t has hitherto been unavailable.
منابع مشابه
An Earley-style Predictive Chart Parsing Method for Lambek Grammars
We present a new chart parsing method for Lambek grammars, inspired by a method for DTree grammar parsing. The formulae of a Lambek sequent are firstly converted into rules of an indexed grammar formalism, which are used in an Earley-style predictive chart algorithm. The method is non-polynomial, but performs well for practical purposes much better than previous chart methods for Lambek grammar...
متن کاملLambek Grammars, Tree Adjoining Grammars and Hyperedge Replacement Grammars
Two recent extension of the nonassociative Lambek calculus, the LambekGrishin calculus and the multimodal Lambek calculus, are shown to generate class of languages as tree adjoining grammars, using (tree generating) hyperedge replacement grammars as an intermediate step. As a consequence both extensions are mildly context-sensitive formalisms and benefit from polynomial parsing algorithms.
متن کاملMaximal Incrementality in Linear Categorial Deduction
Recent work has seen the emergence of a common framework for parsing categorial grammar (CG) formalisms that fall within the 'type-logical' tradition (such as the Lambek calculus and related systems), whereby some method of linear logic theorem proving is used in combination with a system of labelling that ensures only deductions appropriate to the relevant grammatical logic are allowed. The ap...
متن کاملOn the Connection between Context-free Grammars and Lambek Categorial Grammars
Overview A method is described for proving the weak equivalence theorem between natural-deduction style Lambek Categorial Grammmars (LCG) and Context-Free Grammars (CFG). The method is achieved using a simple representation for derivations from the associative, product-free Lambek Calculus in the LF metalanguage 10], which can be adapted to the representation of other substruc-tural logics in L...
متن کاملSyntactic categories and types: Ajdukiewicz and modern categorial grammars
This essay confronts Ajdukiewicz’s approach to syntactic categories with modern categorial grammars, mainly AB-grammars (basic categorial grammars) and Lambek grammars, i.e. categorial grammars based on different versions of the Lambek calculus.
متن کامل